Low - Power Digit - Serial Multipliers

نویسندگان

  • Yun-Nan Chang
  • Janardhan H. Satyanarayana
  • Keshab K. Parhi
چکیده

Digit-serial implementation styles are best suited for implementation of digital signal processing systems which require moderate sampling rates. Digit-serial multipliers obtained using traditional unfolding techniques cannot be pipelined beyond a certain level because of the presence of feedback loops. In this paper, an alternative approach for the design of digit-serial multipliers is presented based on a novel cell replacement transformation. This transformation permits bit-level pipelining of the digit-serial multipliers thereby achieving sample speeds close to corresponding bit-parallel multipliers with signiicantly lower area. This increased sample speed can be traded with reduction in power supply voltage resulting in signiicant reduction in power consumption. The results show that for smaller digit-sizes (4), the type-II multiplier consumes the least power and for larger digit-sizes, the type-I multiplier consumes the least power. It is also found that the optimum digit-size for least power consumption in type-I and type-III multipliers is p 2W, where W represents the word length. The proposed digit-serial multipliers consume on an average 1:75 times lower power than the traditional digit-serial architec-tures for the non-pipelined case, and about 15 times lower power for the bit-level pipelined case.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Design and Implementation of Low-Power Digit-Serial Multipliers

Digit-serial architectures obtained using traditional unfolding techniques cannot be pipelined beyond a certain level because of the presence of feedback loops. In this paper, a novel design methodology is presented which permits bit-level pipelining of the digit-serial ar-chitectures. This enables bit-level pipelining of digit-serial architectures thereby achieving sample speeds close to corre...

متن کامل

Brigham Young University

In a previous paper it was shown that reducing the amount of glitches in digital designs can significantly reduce the amount of dynamic power consumption. Pipelined multipliers and a bit-serial multiplier design were used to show this. The paper failed to mention how much of the dynamic power consumption was due to the clock distribution. Also the only digitserial multiplier digit size investig...

متن کامل

Trade-Offs in Multiplier Block Algorithms for Low Power Digit-Serial FIR Filters

In this paper trade-offs in digit-serial multiplier blocks are studied. Three different algorithms for realization of multiplier blocks are compared in terms of complexity and adder depth. Among the three algorithms is a new algorithm that reduces the number of shifts while the number of adders is on average the same. Hence, the total complexity is reduced for multiplier blocks implemented usin...

متن کامل

Some Issues in Low Power Arithmetic for Fixed-Function DSP

In this paper we discuss some aspects of designing arithmetic circuits with low power consumption. We focus on digit-serial processing techniques, as well as minimum adder multipliers, and multiple constant multiplication. A review of power dissipation sources in CMOS is given. Further, we discuss some methods to decrease the power dissipation of the algorithmic, arithmetic, and architecture le...

متن کامل

Low-Latency Digit-Serial Systolic Double Basis Multiplier over $\mbi GF{(2^m})$ Using Subquadratic Toeplitz Matrix-Vector Product Approach

Recently, the multipliers with subquadratic space complexity for trinomials and some specific pentanomials have been proposed. For such kind of multipliers, alternatively, we use double basis multiplication which combines the polynomial basis and the modified polynomial basis to develop a new efficient digit-serial systolic multiplier. The proposed multiplier depends on trinomials and almost eq...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997